Simple method of computing a function in fixed-point arithmetic
نویسندگان
چکیده
منابع مشابه
Accuracy of the Immersed Boundary Method in Fixed-Point Arithmetic
The immersed boundary (IB) method is an algorithm for simulating elastic structures immersed in a fluid. The IB method can be used, for example, to simulate blood flow in the heart. Even running on supercomputers, software implementations require on the order of seven CPU-days to simulate one heart beat. The IB method has significant, inherent, fine-grain parallelism available. This parallelism...
متن کاملFixed-Point Arithmetic Line Clipping
This algorithm supports line clipping against a rectangular window with edges parallel to the screen. The algorithm combines different partial solutions given in the bibliography such as implicit area codes, decision trees, line ends comparison, symmetry or avoiding redundant calculations, mixing them with fixed-point arithmetic, explicit calculation reusing and dynamic monitoring. It may work ...
متن کاملFormalization of Fixed-Point Arithmetic in HOL
This paper addresses the formalization in higher-order logic of fixed-point arithmetic. We encoded the fixed-point number system and specified the different quantization modes in fixed-point arithmetic such as the directed and even quantization modes. We also considered the formalization of exceptions detection and their handling like overflow and invalid operation. An error analysis is then pe...
متن کاملComputing the Eigen Decomposition of a Symmetric Matrix in Fixed-point Arithmetic
Since a number of signal processing algorithms requiring the EVD of a symmetric matrix are implemented on fixedpoint DSPs, there is considerable interest in matrix diagonalization algorithms that can be implemented in fixed-point arithmetic. We propose modifications to the Jacobi Cyclic Row algorithm that favor a fixed-point implementation. We then compare the eigenvalues and eigenvectors obtai...
متن کاملFixed-Point Arithmetic in SHE Schemes
The purpose of this paper is to investigate fixed point arithmetic in ring-based Somewhat Homomorphic Encryption (SHE) schemes. We provide three main contributions: Firstly, we investigate the representation of fixed point numbers. We analyse the two representations from Dowlin et al, representing a fixed point number as a large integer (encoded as a scaled polynomial) versus a polynomial-based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics Letters
سال: 1997
ISSN: 0013-5194
DOI: 10.1049/el:19971340